Inferring Preferences for Multi-Criteria Ordinal Classification Methods Using Evolutionary Algorithms

نویسندگان

چکیده

Multicriteria sorting involves assigning the objects of decisions (actions) into $a$ priori known ordered classes considering preferences a decision maker (DM). Two new multicriteria methods were recently proposed by authors. These are based on novel approach called interval-based outranking which provides with attractive practical and theoretical characteristics. However, as is well known, defining parameter values for often very difficult. This difficulty arises not only from large number parameters DM’s lack familiarity them, but also imperfectly (even missing) information. Here, we address: i) how to elicit two methods, ii) incorporate imperfect knowledge during elicitation. We follow preference disaggregation paradigm use evolutionary algorithms address it. Our proposal performs in wide range computational experiments. Interesting findings are: method restores assignment examples high effectiveness using three profiles each limiting boundary or representative actions per class; ability appropriately assign unknown can be greatly improved increasing profiles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inferring Phylogenetic Trees Using Evolutionary Algorithms

We consider the problem of estimating the evolutionary history of a collection of organisms in terms of a phylogenetic tree. This is a hard combinatorial optimization problem for which different EA approaches are proposed and evaluated. Using two problem instances of different sizes, it is shown that an EA that directly encodes trees and uses ad-hoc operators performs better than several decode...

متن کامل

Hybrid Methods for Multi-objective Evolutionary Algorithms

Hybrid methods of using evolutionary algorithms with a local search method are often used in the context of singleobjective real-world optimization. In this paper, we discuss a couple of hybrid methods for multi-objective realworld optimization. In the posteriori approach, the obtained non-dominated solutions of a multi-objective evolutionary algorithm (MOEA) run are modified using a local sear...

متن کامل

Dynamic programming methodology for multi-criteria group decision-making under ordinal preferences

A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the crite...

متن کامل

Fast Algorithms for Inferring Evolutionary Trees

We present algorithms for the perfect phylogeny problem restricted to binary characters. The first algorithm is faster than a previous algorithm by Gusfield when the input matrix for the problem is sparse. Next, we present two online algorithms. For the first of these, the set of species is fixed and the characters are given as input one at a time, while, for the second, the set of characters i...

متن کامل

Eager, Lazy and Hybrid Algorithms for Multi-Criteria Associative Classification

Classification aims to map a data instance to its appropriate class (or label). In associative classification the mapping is done through an association rule with the consequent restricted to the class attribute. Eager associative classification algorithms build a single rule set during the training phase, and this rule set is used to classify all test instances. Lazy algorithms, however, do no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3234240